Notions of Equivalence in Software Design

نویسندگان

  • David King
  • Chris Kimble
چکیده

Les méthodes de conception dans des systèmes d'information créent souvent des descriptions de logiciel en utilisant des langages formels. Néanmoins, la plupart des concepteurs de logiciel préfèrent décrire le logiciel en utilisant des langages naturels. Cette distinction n'est pas simplement une question de pragmatisme. Les langages naturels ne sont pas identiques à des langages formels; en particulier, langages naturels ne suivent pas les notions de l'équivalence employées par langages formels. En cet article, nous montrons l'existence et la coexistence de différentes notions de l'équivalence en un extension de la notion des oracles utilisés dans langages formels. Ceci permet à des distinctions d'être faites entre les oracles dignes de confiance assumés par des langages formels et les oracles non dignes de la confiance employés par des langages naturels. En examinant la notion de l'équivalence, nous espérons encourager les concepteurs de logiciel à repenser l'endroit de l'ambiguïté dans la conception de logiciel.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Topological structure on generalized approximation space related to n-arry relation

Classical structure of rough set theory was first formulated by Z. Pawlak in [6]. The foundation of its object classification is an equivalence binary relation and equivalence classes. The upper and lower approximation operations are two core notions in rough set theory. They can also be seenas a closure operator and an interior operator of the topology induced by an equivalence relation on a u...

متن کامل

Equivalence notions for design of concurrent systems using Petri nets

The paper is devoted to the investigation of equivalence notions used to abstract from concrete behavioural aspects of concurrent systems which are modelled by Petri nets. The basic behavioural equivalences known from the literature are supplemented by new ones to obtain the complete picture and examined for all class of nets as well as for some of their subclasses: sequential nets (nets withou...

متن کامل

Equivalence Relations in Fully and Partially Observable Markov Decision Processes

We explore equivalence relations between states in Markov Decision Processes and Partially Observable Markov Decision Processes. We focus on two different equivalence notions: bisimulation [Givan et al., 2003] and a notion of trace equivalence, under which states are considered equivalent if they generate the same conditional probability distributions over observation sequences (where the condi...

متن کامل

Specifying Reusable Components

Reusable software components need well-defined interfaces, rigorously and completely documented features, and a design amenable both to reuse and to formal verification; all these requirements call for expressive specifications. This paper outlines a rigorous foundation to model-based contracts, a methodology to equip classes with expressive contracts supporting the accurate design, implementat...

متن کامل

Product line process theory

Software product lines (SPLs) facilitate reuse and customization in softwaredevelopment by genuinely addressing the concept of variability. Product Line Cal-culus of Communicating Systems (PL-CCS) is a process calculus for behavioralmodeling of SPLs, in which variability can be explicitly modeled by a binary vari-ant operator. In this paper, we study different notions of behavio...

متن کامل

On Fairness Notions in Distributed Systems: II. Equivalence-Completions and Their Hierarchies

This is the second part of a two-part paper in which we discuss the implementability of fairness notions in distributed systems where asynchronous processes interact via multiparty interactions. We focus here on equivalence-robust fairness notions where equivalence computations are either all fair or all unfair. Francez et al. (1992, Formal Aspects Comput. 4, 582–591) propose a notion of comple...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره cs.SE/0406023  شماره 

صفحات  -

تاریخ انتشار 2004